‘DECOMPOSING LINEAR TRANSFORMATIONS’

Decomposing phonological transformations in serial derivations

While most phonological transformations have been shown to be subsequential, there are tonal processes that do not belong to any subregular class, thereby making it difficult to identify a tighter bound on the complexity of phonological processes than the regular languages. This paper argues that a tighter bound obtains from examining the way transformations are computed: when derived in serial...

Decomposing Linear Control Allocation Problems

A strategy for decomposing a class of constrained linear control allocation problems is considered. The actuators are partitioned into groups of mutually non-interacting actuators. The problem is then divided into a set of sub-problems and a master problem, whose solution approximates the solution to the original problem. For some classes of allocation problems the method is extended such that ...

Linear Transformations

The n×m matrix AT obtained by exchanging rows and columns of A is called the transpose of A. A matrix A is said to be symmetric if A = AT . The sum of two matrices of equal size is the matrix of the entry-by-entry sums, and the scalar product of a real number a and an m× n matrix A is the m× n matrix of all the entries of A, each multiplied by a. The difference of two matrices of equal size A a...

On One-Sided Ideals of Rings of Linear Transformations

Decomposing Linear Programs for Parallel Solution

Coarse grain parallelism inherent in the solution of Linear Programming LP problems with block angular constraint matrices has been exploited in recent research works However these approaches su er from unscalability and load imbalance since they exploit only the exist ing block angular structure of the LP constraint matrix In this paper we consider decomposing LP constraint matrices to obtain ...